A Lagrangean Heuristic Approach for the Simultaneous Cyclic Scheduling and Optimal Control of Multi-Grade Polymerization Reactors

نویسندگان

  • Sebastian Terrazas-Moreno
  • Antonio Flores-Tlacuahuac
  • Ignacio E. Grossmann
چکیده

In this work we apply a decomposition technique to address the simultaneous scheduling and optimal control problem of multi-grade polymerization reactors. The simultaneous scheduling and control (SSC) problem is reformulated using Lagrangean Decomposition as presented by Guignard and Kim1. The resulting model is decomposed into scheduling and control subproblems, and solved using a heuristic approach used before by Van den Heever et.al.2 in a different kind of problem. The methodology is tested using a Methyl Methacrylate (MMA) polymerization system, and the High Impact Polystyrene (HIPS) polymerization system, with one continuous stirred-tank reactor (CSTR), and with a complete HIPS polymerization plant composed of a train of seven CSTRs. In these case studies, different polymer grades are produced using the same equipment in a cyclic schedule. The results of the heuristic decomposition technique are compared against those obtained by solving the problem without decomposition, whenever both solutions were available. The presence of a duality gap for the decomposed solution is observed, as expected, when integer variables and other nonconvexities are present. Computational times in the first two examples were lower for the decomposition heuristic than for the direct solution in full space, and the optimal solutions found were slightly better. The example related to the full scale HIPS plant was only solvable using the decomposition heuristic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous Cyclic Scheduling and Optimal Control of Multi-Grade Polymerization Reactors

This paper presents the simultaneous solution of the optimal sequencing and optimal dynamic transitions of two multigrade polymerization CSTRs. The simultaneous formulation results in a Mixed-Integer Dynamic Optimization (MIDO) problem. The profiles of the state variables during dynamic transitions are discretized using orthogonal collocation on finite elements, transforming the MIDO problem in...

متن کامل

Project Scheduling with Simultaneous Optimization, Time, Net Present Value, and Project Flexibility for Multimode Activities with Constrained Renewable Resources

Project success is assessed based on various criteria, every one of which enjoys a different level of importance for the beneficiaries and decision makers. Time and cost are the most important objectives and criteria for the project success. On the other hand, reducing the risk of finishing activities until the predetermined deadlines should be taken into account. Having formulated the problem ...

متن کامل

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

An Improved Optimization Model for Scheduling of a Multi-Product Tree-Like Pipeline

In the petroleum supply chain, oil refined products are often delivered to distribution centers by pipelines since they provide the most reliable and economical mode of transportation over large distances. This paper addresses the optimal scheduling of a complex pipeline network with multiple branching lines. The main challenge is to find the optimal sequence and time of product injections/deli...

متن کامل

A multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems

This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006